Abelian-square-rich words

نویسندگان

  • Gabriele Fici
  • Filippo Mignosi
  • Jeffrey Shallit
چکیده

An abelian square is the concatenation of two words that are anagrams of one another. A word of length n can contain at most Θ(n) distinct factors, and there exist words of length n containing Θ(n) distinct abelian-square factors, that is, distinct factors that are abelian squares. This motivates us to study infinite words such that the number of distinct abelian-square factors of length n grows quadratically with n. More precisely, we say that an infinite word w is abelian-square-rich if, for every n, every factor of w of length n contains, on average, a number of distinct abelian-square factors that is quadratic in n; and uniformly abelian-square-rich if every factor of w contains a number of distinct abelian-square factors that is proportional to the square of its length. Of course, if a word is uniformly abeliansquare-rich, then it is abelian-square-rich, but we show that the converse is not true in general. We prove that the Thue-Morse word is uniformly abelian-square-rich and that the function counting the number of distinct abelian-square factors of length 2n of the Thue-Morse word is 2-regular. As for Sturmian words, we prove that a Sturmian word sα of angle α is uniformly abelian-square-rich if and only if the irrational α has bounded partial quotients, that is, if and only if sα has bounded exponent.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Abelian Square-Free Partial Words

Erdös raised the question whether there exist infinite abelian square-free words over a given alphabet (words in which no two adjacent subwords are permutations of each other). Infinite abelian square-free words have been constructed over alphabets of sizes as small as four. In this paper, we investigate the problem of avoiding abelian squares in partial words (sequences that may contain some h...

متن کامل

Words with the Maximum Number of Abelian Squares

An abelian square is the concatenation of two words that are anagrams of one another. A word of length n can contain Θ(n) distinct factors that are abelian squares. We study infinite words such that the number of abelian square factors of length n grows quadratically with n.

متن کامل

Local Squares, Periodicity and Finite Automata

We consider the general problem when local regularity implies the global one in the setting where local regularity means the existence of a square of certain length in every position of an infinite word. The square can occur as centered or to the left or to the right from each position. In each case there are three variants of the problem depending on whether the square is that of words, that o...

متن کامل

Avoiding abelian squares in partial words

Erdös raised the question whether there exist infinite abelian squarefree words over a given alphabet, that is, words in which no two adjacent subwords are permutations of each other. It can easily be checked that no such word exists over a three-letter alphabet. However, infinite abelian square-free words have been constructed over alphabets of sizes as small as four. In this paper, we investi...

متن کامل

Improved Bounds on the Length of Maximal Abelian Square-free Words

A word is abelian square-free if it does not contain two adjacent subwords which are permutations of each other. Over an alphabet Σk on k letters, an abelian squarefree word is maximal if it cannot be extended to the left or right by letters from Σk and remain abelian square-free. Michael Korn proved that the length `(k) of a shortest maximal abelian square-free word satisfies 4k − 7 ≤ `(k) ≤ 6...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 684  شماره 

صفحات  -

تاریخ انتشار 2017